Stochastic networks for constraint satisfaction and optimization
نویسندگان
چکیده
منابع مشابه
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress the need to extend the super solution framework along several dimensions to make it more useful practically. We demonstrate the usefulness of those extensions on an example from jobshop scheduling, an opti...
متن کاملSystematic Versus Stochastic Constraint Satisfaction
This panel explores issues of systematic and stochastic control in the context of constraint satisfaction.
متن کاملOptimization-based heuristics for maximal constraint satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization problem presented in a previous paper [Meseguer and Larrosa, 95], which has given good results on some classes of solvable CSP. For MAX-CSP, we have developed two heuristics for dynamic variable and value ordering, calle...
متن کاملOptimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization problem presented in a previous paper [Meseguer and Larrosa, 95], which has given good results on some classes of solvable CSP. For MAX-CSP, we have developed two heuristics for dynamic variable and value ordering, calle...
متن کاملDistributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance
Many distributed problems can be captured as distributed constraint satisfaction problems (CSPs) and constraint optimization problems (COPs). In this research, we study an existing distributed search method, called distributed stochastic algorithm (DSA), and its variations for solving distributed CSPs and COPs. We analyze the relationship between the degree of parallel executions of distributed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1990
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02811324